Polygonal approximation of plane convex compacta

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gradient algorithms for polygonal approximation of convex contours

The subjects of this paper are descent algorithms to optimally approximate a strictly convex contour with a polygon. This classic geometric problem is relevant in interpolation theory and data compression, and has potential applications in robotic sensor networks. We design gradient descent laws for intuitive performance metrics such as the area of the inner, outer, and “outer minus inner” appr...

متن کامل

Polygonal Approximation of Flows

The analysis of the qualitative behavior of flows generated by ordinary differential equations often requires quantitative information beyond numerical simulation which can be difficult to obtain analytically. In this paper we present a computational scheme designed to capture qualitative information using ideas from the Conley index theory. Specifically we design an combinatorial multivalued a...

متن کامل

Undecidability of Plane Polygonal Mereotopology

This paper presents a mereotopological model of polygonal regions of the Euclidean plane and an undecidability proof of its rst-order theory. Restricted to the primitive operations the model is a Boolean algebra. Its single primitive predicate deenes simple polygons as the topologically simplest poly-gonal regions. It turns out that both the relations usually provided by mereotopolo-gies and mo...

متن کامل

Gruenhage Compacta and Strictly Convex Dual Norms

We prove that if K is a Gruenhage compact space then C (K) admits an equivalent, strictly convex dual norm. As a corollary, we show that if X is a Banach space and X∗ = span|||·|||(K), where K is a Gruenhage compact in the w∗-topology and ||| · ||| is equivalent to a coarser, w∗-lower semicontinuous norm on X∗, then X∗ admits an equivalent, strictly convex dual norm. We give a partial converse ...

متن کامل

The Cross-section Body, Plane Sections of Convex Bodies and Approximation of Convex Bodies, Ii*

We compare the volumes of projections of convex bodies and the volumes of the projections of their sections, and, dually, those of sections of convex bodies and of sections of their circumscribed cylinders. For L ⊂ R a convex body, we take n random segments in L and consider their ‘Minkowski average’ D. For fixed n, the pth moments of V (D) (1 ≤ p < ∞) are minimized, for V (L) fixed, by the ell...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Approximation Theory

سال: 1983

ISSN: 0021-9045

DOI: 10.1016/0021-9045(83)90130-2